|
|
Port of OptaPlanner on Android
David, Tomáš ; Rogalewicz, Adam (referee) ; Letko, Zdeněk (advisor)
This thesis deals with portation of the OptaPlanner tool to the Android operating system. The OptaPlanner is used for solving planning problems and it is completely written in the Java programming language which is also used for application development of the Android operating system. However, Android does not contain all of the Java Standard Edition Application Programming Interface libraries and porting of OptaPlanner to Android thus causes dependency problems. The result of the thesis is solution design and implementation of the problems mentioned above and model Android Vehicle Routing Problem application which uses ported OptaPlanner tool.
|
|
| |
|
|
Evolutionary Optimization of Freight Transportation
Beránek, Michal ; Drahošová, Michaela (referee) ; Bidlo, Michal (advisor)
The following thesis deals with optimization of freight transport planning. The goal is to minimize expenses connected to transportation, which emerge from travelled distance. The expenses can be heavily reduced, if the routes are correctly planned, especially when there is a large number of customers to be served. This thesis focuses on solving the problem by using the evolutional algorithms, that are optimization methods based on principles of evolution. Thesis concentrates on Heterogeneous Fixed Fleet Vehicle Routing Problem. Thesis introduces multiple evolutional algorithms and their results are compared. The best algorithm, evolutional strategy with local neighbourhood search, achieves similar, for certain tasks even better results, than other existing evolutional algorithms, created to solve given problem.
|
|
|
Travelling Salesman Problem Application in Particular Logistics Enterprise
Ružička, Vladimír ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
This paper deals with optimal distribution issues. One may find listed problems of real life linked to distribution. Moreover, there are explained travelling salesman problem, vehicle routing problem and its variants. This work brings an overview of different ways how to solve vehicle routing problem. In practical part, there is an analysis of distribution of real company. The concept of application is presented in the second part of this paper. This concept could reduce costs of distribution in analyzed company. Testing is aimed mainly on the variant VRPCL (Vehicle Routing Problem with Continuos Loading).
|
|
|
Models and methods for routing problems
Nevrlý, Vlastimír ; Žák, Libor (referee) ; Popela, Pavel (advisor)
This master's thesis deals with mathematical model building for routing problems and ways to solve them. There are discussed and implemented deterministic and heuristic approaches that are suitable to be utilized. A big effort is put into building of the mathematical model describing a real world problem from the field of waste management. Appropriate algorithms are developed and modified to solve a particular problem effectively. An original graphical environment is created to illustrate acquired results and perform testing computations.
|
|
|
Routing Problems and Their Solutions
Pospíšil, Václav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The first part of the thesis is devoted to an Introduction and a comprehensive description of all important concepts of graph theory, which is followed by descriptions and modifications of two selected types of routing problems: the travelling salesman problem and the vehicle routing problem. The next part of the thesis deals with subsequent possibilities of solving problems through deterministic and stochastic algorithms. It also includes a practical part, which at the end of the thesis deals with the shortest path optimization of the two created models using Nearest neighbour algorithm, Genetic algorithm and solver in GAMS.
|
|
|
Algorithms for Computerized Optimization of Logistic Combinatorial Problems
Bokiš, Daniel ; Peringer, Petr (referee) ; Hrubý, Martin (advisor)
This thesis deals with optimization problems with main focus on logistic Vehicle Routing Problem (VRP). In the first part term optimization is established and most important optimization problems are presented. Next section deals with methods, which are capable of solving those problems. Furthermore it is explored how to apply those methods to specific VRP, along with presenting some enhancement of those algorithms. This thesis also introduces learning method capable of using knowledge of previous solutions. At the end of the paper, experiments are performed to tune the parameters of used algorithms and to discuss benefit of suggested improvements.
|
|
|
Modelling of logistics of inter-municipal waste transport
Kučera, Jiří ; Popela, Pavel (referee) ; Nevrlý, Vlastimír (advisor)
This diploma thesis focuses on the issue of inter-municipal waste transport. The main part of the thesis focuses on the development of a computing core designed to create a collection plan for selected municipalities forming a union. The computing core was created so that it could be integrated into a user-friendly web application. The creation of a computational tool is based on the theoretical foundations of graph theory, mathematical programming and heuristic algorithms. In this thesis, consecutive algorithms for clustering of address points, collection design for several types of waste with a heterogeneous vehicle fleet and for creating collection proposal for a several-week long collection plan were developed. The presented approach was tested on real data from an existing union of municipalities in the South Moravian Region.
|
|
|
Optimizations Methods for Freight Transportation
Gabonay, Michal ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
The following work concerns the study of the evolutionary algorithm, which optimizes freight transport planning. The demand for freight transport is constantly increasing nowadays and with creating, implementing and using proper route planning we are able to significantly reduce transportation costs. However, it is preferably to implement it in companies with large numbers of served customers and with a sufficiently large fleet of vehicles. The study starts by defining what fright transport planning problem is and by characterizing its existing specifications and variants. My work proceeds to give a background of the possible solutions to the multifaceted aspects of the problem. The specific subproblem I choose to focus on is the Vehicle routing problem with Pickup and Delivery for which I apply the optimization solution. In the main body of my thesis, I will elaborate on the chosen optimization solution which encompasses the genetic algorithm and evolutionary strategy. The aim of the study is to measure the suitability of the algorithms and techniques used, for which reason the final part of my work will deal with the analysis and evaluation of the experiments.
|
|
|
Modelling of logistics of inter-municipal waste transport
Kučera, Jiří ; Popela, Pavel (referee) ; Nevrlý, Vlastimír (advisor)
This diploma thesis focuses on the issue of inter-municipal waste transport. The main part of the thesis focuses on the development of a computing core designed to create a collection plan for selected municipalities forming a union. The computing core was created so that it could be integrated into a user-friendly web application. The creation of a computational tool is based on the theoretical foundations of graph theory, mathematical programming and heuristic algorithms. In this thesis, consecutive algorithms for clustering of address points, collection design for several types of waste with a heterogeneous vehicle fleet and for creating collection proposal for a several-week long collection plan were developed. The presented approach was tested on real data from an existing union of municipalities in the South Moravian Region.
|
guest ::
